Simplified design for concurrent statistical zero-knowledge arguments
نویسندگان
چکیده
منابع مشابه
Statistical Zero-knowledge Arguments: Theory and Practice
During a statistical zero-knowledge argument, the arguer convinces the verifier on the truth of an assertment, without revealing next to nothing—but the truth of the assertment—even to an omnipotent verifier. The crucial part here is “next to nothing”: compared to perfect zero-knowledge arguments where absolutely nothing (but the truth of the assertment) can be revealed, statistical zero-knowle...
متن کاملConcurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformation relies only on the existence of one-way functions. It is known that the existence of zeroknowledge systems for any non-trivial language implies one way functions. Hence our transformation unconditionally shows that co...
متن کاملStatistical Concurrent Non-malleable Zero Knowledge
The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985 is fundamental in Cryptography. Motivated by conceptual and practical reasons, this notion has been explored under stronger definitions. We will consider the following two main strengthened notions. Statistical Zero Knowledge: here the zero-knowledge property will last forever, even in case in future the adve...
متن کاملOn Diophantine Complexity and Statistical Zero-Knowledge Arguments
We show how to construct laconic honest-verifier statistical zeroknowledge Diophantine arguments of knowledge (HVSZK AoK) that a committed tuple of integers belongs to S for all languages in bounded arithmetic. While doing this, we propose a new algorithm for computing the Lagrange representation of nonnegative integers and a new efficient representing polynomial for the exponential relation. A...
متن کاملSublinear Zero-Knowledge Arguments for RAM Programs
We describe a new succinct zero-knowledge argument protocol with the following properties. The prover commits to a large dataset M , and can thereafter prove many statements of the form ∃w : Ri(M,w) = 1, where Ri is a public function. The protocol is succinct in the sense that the cost for the verifier (in computation & communication) does not depend on |M |, not even in any initialization phas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsinghua Science and Technology
سال: 2009
ISSN: 1007-0214
DOI: 10.1016/s1007-0214(09)70038-0